On Boundedness Problems for Pushdown Vector Addition Systems
نویسندگان
چکیده
We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reachability set for this model can be refined into two decision problems that ask if infinitely many counter values or stack configurations are reachable, respectively. Counter boundedness seems to be the more intricate problem. We show decidability in exponential time for one-dimensional systems. The proof is via a small witness property derived from an analysis of derivation trees of grammar-controlled vector addition systems.
منابع مشابه
The Termination/Boundedness Problem of Well-Structured Pushdown Systems
Recently, models that combine vector addition systems and pushdown systems have attracted lots of attentions. They can model some classes of concurrent recursive computations, still enjoying certain decidability properties. A well-structured pushdown system (WSPDS) [1] has been proposed to unify such models. It extends a pushdown system with (possibly infinitely many) well-quasi-ordered states ...
متن کاملBoundedness of linear order-homomorphisms in $L$-topological vector spaces
A new definition of boundedness of linear order-homomorphisms (LOH)in $L$-topological vector spaces is proposed. The new definition iscompared with the previous one given by Fang [The continuity offuzzy linear order-homomorphism, J. Fuzzy Math. 5 (4) (1997)829$-$838]. In addition, the relationship between boundedness andcontinuity of LOHs is discussed. Finally, a new uniform boundednessprincipl...
متن کاملThe Covering and Boundedness Problems for Branching Vector Addition Systems
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
متن کاملPlace-Boundedness for Vector Addition Systems with one zero-test
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a variation of the Karp-Miller algorithm to compute a basis of the downward closure of the reachability set which allows to decide place-boundedness. This forward algorithm is able to pass the zero-tests thanks to a finer ...
متن کاملWeighted Pushdown Systems with Indexed Weight Domains
The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing the weight of the rule. However, we have realized that the restriction of the boundedness is too strict and the formulation of weighted pushdown ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015